Indecomposable prefix codes and prime trees
نویسندگان
چکیده
In this paper we introduce a notion of divisibility and primality on k-ary trees and we nd a relation between indecomposable preex code and prime trees. This relation allows to work on trees instead than directly on preex codes. In this way we can prove a density theorem for indecomposable preex codes and we can give an algorithm to test the indecomposability of a maximal preex code.
منابع مشابه
Prefix codes, trees and automata
We inv~stigate-the relations be'·"'h.",pn the tree representation of a prefix code C, its patterns, the minimal automaton ~ * whi.ch recognizes C and the homomorphic images of the underlying algebra of ::G'. These relations provide us with an appealing formulation which allows us to state (and eventually solve) some problems concerning the structure of prefix codes and therefore the structure o...
متن کاملOn generalized reduced representations of restricted Lie superalgebras in prime characteristic
Let $mathbb{F}$ be an algebraically closed field of prime characteristic $p>2$ and $(g, [p])$ a finite-dimensional restricted Lie superalgebra over $mathbb{F}$. It is showed that anyfinite-dimensional indecomposable $g$-module is a module for a finite-dimensional quotient of the universal enveloping superalgebra of $g$. These quotient superalgebras are called the generalized reduced enveloping ...
متن کاملSparse and Truncated Suffix Trees on Variable-Length Codes
The sparse suffix trees (SST), introduced by (Kärkkäinen and Ukkonen, COCOON 1996), is the suffix tree for a subset of all suffixes of an input text T of length n. In this paper, we study a special case that an input string is a sequence of codewords drawn from a regular prefix code ∆ ⊆ Σ recognized by a finite automaton, and index points locate on the code boundaries. In this case, we present ...
متن کاملConstructing critical indecomposable codes
Critical indecomposable codes were introduced by Assmus [1], who also gave a recursive construction for these objects. One of the key ingredients in the construction is an auxiliary code, which is an indecomposable code of minimum distance at least 3. In terms of actually being able to construct all critical indecomposable codes, however, Assmus leaves many unanswered questions about these auxi...
متن کاملOn the size of transducers for bidirectional decoding of prefix codes
In a previous paper [5] a bi-deterministic transducer is defined for the bidirectional decyphering of words by the method introduced by Girod [6]. Such a method is defined using prefix codes. Moreover a coding method, inspired by the Girod’s one, is introduced, and a transducer that allows both right-to-left and left-to-right decoding by this method is defined. It is proved also that this trans...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997